منابع مشابه
On Uniformity within NC¹
In order to study circuit complexity classes within NC in a uniform setting we need a uniformity condition which is more restrictive than those in common use Two such conditions stricter than NC uniformity Ru Co have appeared in recent research Immerman s families of circuits de ned by rst order formulas Im a Im b and a unifor mity corresponding to Buss deterministic log time reductions Bu We s...
متن کاملOn Uniformity Within
1 Abstract In order to study circuit complexity classes within NC 1 in a uniform setting, we need a uniformity condition which is more restrictive than those in common use. Two such conditions, stricter than NC 1 uniformity Ru81,Co85], have appeared in recent research: Immerman's families of circuits deened by rst-order formulas Im87a,Im87b] and a uniformity corresponding to Buss' deterministic...
متن کاملSpecialization or uniformity within the profession?
Several articles on the developing specialty of hand therapy within occupational therapy were featured in the September 27, 1990, issue of OT Week. It was disturbing to read, however, that the American Society of Hand Therapists was founded in 1977 not to augment or promote occupational therapy's knowledge base or practice, but rather, to "foster the advancement of the profession of hand therap...
متن کاملNondeterministic NC1 Computation
We deene the counting classes #NC 1 , GapNC 1 , PNC 1 and C = NC 1. We prove that boolean circuits, algebraic circuits, programs over non-deterministic nite automata, and programs over constant integer matrices yield equivalent deenitions of the latter three classes. We investigate closure properties. We observe that #NC 1 #L, that PNC 1 L, and that C = NC 1 L. Then we exploit our nite automato...
متن کاملTopology inside NC1
We show that ACC0 is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC0. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1990
ISSN: 0022-0000
DOI: 10.1016/0022-0000(90)90022-d